Learning mixtures of point distribution models with the EM algorithm
نویسندگان
چکیده
This paper demonstrates how the EM algorithm can be used for learning and matching mixtures of point distribution models. We make two contributions. First, we show how shape-classes can be learned in an unsupervised manner. We present a fast procedure for training point distribution models using the EM algorithm. Rather than estimating the class means and covariance matrices needed to construct the PDM, the method iteratively re3nes the eigenvectors of the covariance matrix using a gradient ascent technique. Second, we show how recognition by alignment can be realised by 3tting a mixture of linear shape deformations. We evaluate the method on the problem of learning the class-structure and recognising Arabic characters. ? 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
منابع مشابه
A Hybrid Algorithm for Optimal Location and Sizing of Capacitors in the presence of Different Load Models in Distribution Network
In practical situations, distribution network loads are the mixtures of residential, industrial, and commercial types. This paper presents a hybrid optimization algorithm for the optimal placement of shunt capacitor banks in radial distribution networks in the presence of different voltage-dependent load models. The algorithm is based on the combination of Genetic Algorithm (GA) and Binary Part...
متن کاملUnsupervised learning of regression mixture models with unknown number of components
Regression mixture models are widely studied in statistics, machine learning and data analysis. Fitting regression mixtures is challenging and is usually performed by maximum likelihood by using the expectation-maximization (EM) algorithm. However, it is well-known that the initialization is crucial for EM. If the initialization is inappropriately performed, the EM algorithm may lead to unsatis...
متن کاملOn Convergence Properties of the EM Algorithm for Gaussian Mixtures
We build up the mathematical connection between the ”ExpectationMaximization” (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a projection matrix P, and we provide an explicit expression for the matrix. We then analyze the convergence of EM in terms of special ...
متن کاملA Global Structural EM Algorithm for a Model of Cancer Progression
Cancer has complex patterns of progression that include converging as well as diverging progressional pathways. Vogelstein’s path model of colon cancer was a pioneering contribution to cancer research. Since then, several attempts have been made at obtaining mathematical models of cancer progression, devising learning algorithms, and applying these to cross-sectional data. Beerenwinkel et al. p...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 36 شماره
صفحات -
تاریخ انتشار 2003